Isometry Classes of Indecomposable Linear Codes
نویسندگان
چکیده
In the constructive theory of linear codes, we can restrict attention to the isometry classes of indecomposable codes, as it was shown by Slepian. We describe these classes as orbits and we demonstrate how they can be enumerated using cycle index polynomials and the tools already incorporated in SYMMETRICA, a computer algebra package devoted to representation theory and combinatorics of symmetric groups and of related classes of groups. Moreover, we describe how systems of representatives of these classes can be evaluated using double coset methods.
منابع مشابه
Random Generation of Linear Codes
Isometry classes of linear codes can be expressed as orbits under the group action of a wreath product. Some combinatorial and algebraic methods are discussed which can be applied for generating linear codes distributed uniformly at random over all isometry classes.
متن کاملThe automorphism groups of linear codes and canonical representatives of their semilinear isometry classes
The main aim of the classification of linear codes is the evaluation of complete lists of representatives of the isometry classes. These classes are mostly defined with respect to linear isometry, but it is well known that there is also the more general definition of semilinear isometry taking the field automorphisms into account. This notion leads to bigger classes so the data becomes smaller....
متن کاملIsometry and automorphisms of constant dimension codes
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
متن کاملOn the Category of Group Codes
For the category of group codes, that generalizes the category of linear codes over a finite field, and with the generalized notions of direct sums and indecomposable group codes, we prove that every MDS non trivial code, every perfect non trivial code, and every constant weight nondegenerate group code are indecomposable. We prove that every group code is a direct sum of indecomposable group c...
متن کاملIsometry groups of combinatorial codes
Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes, where these groups are the same, it is shown that for combinatorial codes the groups can be arbitrary different. Particularly, there exist codes with the fu...
متن کامل